Complete Nevanlinna–Pick Kernels

Complete Nevanlinna-Pick Kernels

We give a new treatment of Quiggin’s and McCullough’s characterization of complete Nevanlinna-Pick kernels. We show that a kernel has the matrix-valued NevanlinnaPick property if and only if it has the vector-valued Nevanlinna-Pick property. We give a representation of all complete Nevanlinna-Pick kernels, and show that they are all restrictions of a universal complete Nevanlinna-Pick kernel.

Complete parameterization of piecewise-polynomial interpolation kernels

Every now and then, a new design of an interpolation kernel appears in the literature. While interesting results have emerged, the traditional design methodology proves laborious and is riddled with very large systems of linear equations that must be solved analytically. We propose to ease this burden by providing an explicit formula that can generate every possible piecewise-polynomial kernel ...

1786 - 0091 Complete Interpolation Vs . Riesz Bases of Reproducing Kernels

In the study of Hilbert spaces of analytic functions, it is noticed that complete interpolating sequences and Riesz bases of reproducing kernels are dual notions. In this work we make this duality explicit by identifying sequences of complex numbers with linear operators.

Reproducing kernels , Bergman kernels , Poisson kernels

String Kernels , Fisher Kernels

In this paper we show how the generation of documents can be thought of as a k-stage Markov process, which leads to a Fisher kernel from which the n-gram and string kernels can be reconstructed. The Fisher kernel view gives a more exible insight into the string kernel and suggests how it can be parametrised in a way that re-ects the statistics of the training corpus. Furthermore, the prob-abili...